The Closed Linear Span of { xk - ck } ; 30

نویسنده

  • ALLAN PINKUS
چکیده

Let { ck} ;” be a given real sequence. We wish to determine, in the first instance, easily verified conditions on {ck > F which imply that the sequence of functions { Xk ck > ;” IS total in C[O, 11; that is, that the closed linear span F{xk ck) is all of C[O, l] or, in other words, that every real function, continuous in [0, 11, is the limit, in the uniform norm, of a sequence of finite linear combinations of the xk ck. When this happens we refer to {ck};c as an approximating sequence. Since the sequence (.x”jF is total in C[O, 11, our problem is equivalent to demanding that the function f(x) E 1 belong to P{.x“ ck}. In this case we wish, in the second instance, to find an effective approximation to f(x) = 1 in the uniform norm on [O, l] by finite linear combinations of the 2~~ ck. An equivalent formulation of our problem, which is sometimes useful, is afforded by the following proposition. This proposition is an elementary application of the Hahn-Banach theorem.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The Closed Linear Span of { xk - ck

Let {ck) r be a given real sequence. We wish to determine, in the first instance, easily verified conditions on { ck > ;” which imply that the sequence of functions { 2 ck} p is total in C[O, 11; that is, that the closed linear span P{x”ck} is all of C[O, l] or, in other words, that every real function, continuous in [0, 11, is the limit, in the uniform norm, of a sequence of finite linear comb...

متن کامل

Linear algebra review

For each natural number n, the n-dimensional Euclidean space is denoted by R, and it is a vector space over the real field R (i.e., R is a real vector space). Vectors v1, . . . , vk ∈ R are linearly dependent if there exist c1, . . . , ck ∈ R, not all zero, such that c1v1 + · · ·+ ckvk = 0. If v1, . . . , vk ∈ R are not linearly dependent, then we say they are linearly independent. The span of ...

متن کامل

Generalized Colorful Linear Programming and Further Applications

Colorful linear programming (CLP) is a generalization of linear programming that was introduced by Bárány and Onn. Given k point sets C1, . . . , Ck ⊂ R that each contain a point b ∈ R in their positive span, the problem is to compute a set C ⊆ C1 ∪ · · · ∪ Ck that contains at most one point from each set Ci and that also contains b in its positive span, or to state that no such set exists. CLP...

متن کامل

On Some Diophantine Equations (i)

In this paper we study the equation m−n = py,where p is a prime natural number, p≥ 3. Using the above result, we study the equations x + 6pxy + py = z and the equations ck(x 4 + 6pxy + py) + 4pdk(x y + pxy) = z, where the prime number p ∈ {3, 7, 11, 19} and (ck, dk) is a solution of the Pell equation, either of the form c −pd = 1 or of the form c − pd = −1. I. Preliminaries. We recall some nece...

متن کامل

Lecture 5: Lifts of Polytopes and Non-negative Rank

P conv ({x1 , . . . , xk}) for some x1 , . . . , xk ∈ ’d . Every polytope has a dual representation: It is a closed and bounded set defined by a family of linear inequalities P {x ∈ ’d : Ax 6 b} for some matrix A ∈ ’m×d . Let us define a measure of complexity for P: Define γ(P) to be the smallest number m such that for some C ∈ ’s×d , y ∈ ’s ,A ∈ ’m×d , b ∈ ’m , we have P {x ∈ ’d : Cx y and Ax ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1985